Beyond “Error-Correction”

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Beyond “Error-Correction”

correction view, evolution equipped us with hierarchical generative neural models precisely for the purpose of resolving ambiguity. But research on direct learning, inspired by ecological psychology (Gibson, 1979), and in particular by the theory of direct perception, does not bite the Helmholtzian bullet of an inherent ambiguous mind-world linkage. Instead, constraints that operate at an ecolo...

متن کامل

Quantum error correction beyond qubits

Quantum computation and communication rely on the ability to manipulate quantum states robustly and with high fidelity. To protect fragile quantum-superposition states from corruption through so-called decoherence noise, some form of error correction is needed. Therefore, the discovery of quantum error correction1,2 (QEC) was a key step to turn the field of quantum information from an academic ...

متن کامل

Quantum Error-Correction Codes on Abelian Groups

We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.

متن کامل

Decoding of Reed Solomon Codes beyond the Error-Correction Bound

We present a randomized algorithm which takes as input n distinct points {(xi, yi)}i=1 from F × F (where F is a field) and integer parameters t and d and returns a list of all univariate polynomials f over F in the variable x of degree at most d which agree with the given set of points in at least t places (i.e., yi = f(xi) for at least t values of i), provided t = Ω( √ nd). The running time is...

متن کامل

Decoding Reed Solomon Codes beyond the Error-Correction Diameter

We describe a new algorithm for the decoding of Reed Solomon codes. This algorithm was originally described in [12]. While the algorithm presented in this article is the same, the presentation is somewhat di erent. In particular we derive more precise bounds on the performance of the algorithm and show the following: For an [n; n; (1 )n]q Reed Solomon code, the algorithm in [12] corrects ( ( ) ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Frontiers in Psychology

سال: 2012

ISSN: 1664-1078

DOI: 10.3389/fpsyg.2012.00423